Succinct data structures for flexible text retrieval systems

Succinct data structures for flexible text retrieval systems

We propose succinct data structures for text retrieval systems supporting document listing queries and ranking queries based on the tf*idf (term frequency times inverse document frequency) scores of documents. Traditional data structures for these problems support queries only for some predetermined keywords. Recently Muthukrishnan proposed a data structure for document listing queries for arbi...

Succinct Data Structures for Retrieval and Approximate Membership

The retrieval problem is the problem of associating data with keys in a set. Formally, the data structure must store a function f : U → {0, 1} that has specified values on the elements of a given set S ⊆ U , |S| = n, but may have any value on elements outside S. All known methods (e. g. those based on perfect hash functions), induce a space overhead of Θ(n) bits over the optimum, regardless of ...

Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

The retrieval problem is the problem of associating data with keys in a set. Formally, the data structure must store a function f : U → {0, 1}r that has specified values on the elements of a given set S ⊆ U , |S| = n, but may have any value on elements outside S. Minimal perfect hashing makes it possible to avoid storing the set S, but this induces a space overhead of Θ(n) bits in addition to t...

Succinct Dynamic Data Structures

We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a sequence of elements which supports insertion, deletion and access of an element at any given index. For the partial sums problem on n non-negative integers of k bits each, we support update operations in O(b) t...

Succinct Data Structures